Probabilistic A ne Invariants for RecognitionThomas

نویسندگان

  • Thomas K. Leung
  • Michael C. Burl
  • Pietro Perona
چکیده

Under a weak perspective camera model, the image plane coordinates in diierent views of a planar object are related by an aane transformation. Because of this property, researchers have attempted to use aane invariants for recognition. However, there are two problems with this approach: (1) objects or object classes with inherent variability cannot be adequately treated using invariants; and (2) in practice the calculated aane invariants can be quite sensitive to errors in the image plane measurements. In this paper we use probability distributions to address both of these diiculties. Under the assumption that the feature positions of a planar object can be modeled using a jointly Gaussian density, we have derived the joint density over the corresponding set of aane coordinates. Even when the assumptions of a planar object and a weak perspective camera model do not strictly hold, the results are useful because deviations from the ideal can be treated as deformability in the underlying object model.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A General Method to Determine Invariants

The determination of invariant characteristics is an important problem in pattern recognition. Many invariants are known: Hu's moment invariants are invariant to shifts, to changes of scale, and to rotations [Hu62]; Burkhardt's Fourier descriptors to shifts, to changes of scale and to rotations [Bu79]; Arbter's Fourier descriptors to a ne transformations [Ar90]; Wang's invariant moments to a ne...

متن کامل

Expectation Invariants for Probabilistic Program Loops as Fixed Points

We present static analyses for probabilistic loops using expectation invariants. Probabilistic loops are imperative while-loops augmented with calls to random value generators. Whereas, traditional program analysis uses Floyd-Hoare style invariants to over-approximate the set of reachable states, our approach synthesizes invariant inequalities involving the expected values of program expression...

متن کامل

Clifford Modules and Invariants of Quadratic Forms

We construct new invariants of quadratic forms over commutative rings, using ideas from Topology. More precisely, we de…ne a hermitian analog of the Bott class with target algebraic K-theory, based on the classi…cation of Cli¤ord modules. These invariants of quadratic forms go beyond the classical invariants de…ned via the Cli¤ord algebra. An appendix by J.-P. Serre, of independent interest, de...

متن کامل

New Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups

In this paper, a new  algorithm for computing secondary invariants of  invariant rings of monomial groups is presented. The main idea is to compute simultaneously a truncated SAGBI-G basis and the standard invariants of the ideal generated by the set of primary invariants.  The advantage of the presented algorithm lies in the fact that it is well-suited to complexity analysis and very easy to i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998